2 1 HEURISTIC PROOF OF THE INVERSION FORMULAcomplication
نویسندگان
چکیده
The present paper is part I of a series of three closely related papers in which the inverse measure (dt) of a given measure (dt) on 0; 1] is introduced. In the rst case discussed in detail, and are multifractal in the usual sense, that is, both are linearly self-similar and continuous but not diierentiable and both are non{zero for every interval of 0; 1]. Under these assumptions the HH older spectra of (dt) and (dt) are shown to be linked by thèinversion formula' f () = f(1==). The inversion formula is then subjected to several diverse variations, which reveal telling details of interest to the full understanding of multifractals. The inverse of the uniform measure on a Cantor dust leads us to argue that this inversion formula applies to the HH older spectra f H even if the measures and are not continuous while it may fail for the spectrum f L obtained by the Legendre path. This phenomenon goes along with a loss of concavity in the spectrum f H. Moreover, with the examples discussed it becomes natural to include the degenerate HH older exponents 0 and 1 in the HH older spectra. This present paper is the rst of three closely related papers on inverse measures, introducing the new notion in a language adopted for the physicist. Parts II and III RM2, RM3] make rigorous what is argued with intuitive arguments here. Part II extends the common scope of the notion of self-similar measures. With this broader class of invariant measures part III shows that the multifractal formalism may fail. 1 Heuristic proof of the inversion formula To begin, let us state once again that a multifractal is not a set but a measure. Many multifractals of interest in physics are supported by fractal sets. However, to gain a full intuitive understanding of the notion of multifractal, unencumbered by extraneous
منابع مشابه
A bijective proof of Macdonald’s reduced word formula
For example, the permutation [3, 2, 1] ∈ S3 has 2 reduced words, R([3, 2, 1]) = {(1, 2, 1), (2, 1, 2)}. The inversion number is `([3, 2, 1]) = 3, and the Schubert polynomial Sπ is the single term x1x2. We observe that Macdonald’s formula holds: 1 · 2 · 1 + 2 · 1 · 2 = 3! · 1. †Email: [email protected]. Billey was partially supported by grant DMS-1101017 from the NSF. ‡Email: holroyd@mi...
متن کاملOn the modular inversion hidden number problem
We give a rigorous deterministic polynomial time algorithm for the modular inversion hidden number problem introduced by D. Boneh, S. Halevi and N. A. Howgrave-Graham in 2001. For our algorithm we need to be given about 2/3 of the bits of the output, which matches one of the heuristic algorithms of D. Boneh, S. Halevi and N. A. Howgrave-Graham and answers one of their open questions. However th...
متن کاملInverse Measures , the Inversion Formula , andDiscontinuous
The present paper is part I of a series of three closely related papers in which the inverse measure (dt) of a given measure (dt) on 0; 1] is introduced. In the rst case discussed in detail, and are multifractal in the usual sense, that is, both are linearly self-similar and continuous but not diierentiable and both are non{zero for every interval of 0; 1]. Under these assumptions the HH older ...
متن کاملs-Inversion Sequences and P-Partitions of Type B
Given a sequence s = (s1, s2, . . .) of positive integers, the notion of inversion sequences with respect to s, or s-inversion sequences, was introduced by Savage and Schuster in their study of lecture hall polytopes. A sequence (e1, e2, . . . , en) of nonnegative integers is called an s-inversion sequence of length n if 0 ≤ ei < si for 1 ≤ i ≤ n. Let In be the set of s-inversion sequences of l...
متن کاملLagrange Inversion Counts 35241-Avoiding Permutations
In a previous paper, we showed that 35241-avoiding permutations are counted by the unique sequence that starts with a 1 and shifts left under the self-composition transform. The proof uses a complicated bijection. Here we give a much simpler proof based on Lagrange inversion.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007